A Formal Temporal Semantics for Microsoft Project based on Allen's Interval Algebra
نویسندگان
چکیده
Process modeling systems are complex and difficult to compare. A key attribute of any process modeling formalism or tool is time which involves how it handles and represents temporal dependencies and constraints. We are interested in doing a temporal based comparison between process modeling formalisms and tools by first converting them to a common representation. The temporal representation chosen is Allen’s interval algebra. In this paper, we explain how to convert a project specified in Microsoft Project to a set of logical formulas. This conversion provides a formal temporal semantics for Microsoft Project. .
منابع مشابه
Constraint Propagation Algorithms
This paper revises and expands upon a paper presented by two of the present authors at AAAI 1986 [Vilain & Kautz 1986]. As with the original, this revised document considers computational aspects of intervalbased and point-based temporal representations. Computing the consequences of temporal assertions is shown to be computationally intractable in the interval-based representation, but not in ...
متن کاملQualitative Temporal Behavior Description and Temporal Diagnosis Using Interval Algebra
As noticed in some recent work, describing and diagnosing temporal behavior and faults is an important, but complex task. In this paper we discuss a new approach based on a subset of Allen's interval algebra, which extends previous work by allowing both the representation of qualitative temporal behavior (including symptoms over time) and the diagnosis of these systems.
متن کاملEight Maximal Tractable Subclasses of Allen's Algebra with Metric Time
This paper combines two important directions of research in temporal reson-ing: that of nding maximal tractable subclasses of Allen's interval algebra, and that of reasoning with metric temporal information. Eight new maximal tractable subclasses of Allen's interval algebra are presented, some of them subsuming previously reported tractable algebras. The algebras allow for metric temporal const...
متن کاملReasoning about Temporal Relations : A Maximal Tractable Subclassof
We introduce a new subclass of Allen's interval algebra we call \ORD-Horn subclass," which is a strict superset of the \pointisable subclass." We prove that reasoning in the ORD-Horn subclass is a polynomial-time problem and show that the path-consistency method is suucient for deciding satissability. Further, using an extensive machine-generated case analysis, we show that the ORD-Horn subclas...
متن کاملEight Maximal Tractable Subclasses of Allen ' s
This paper combines two important directions of research in temporal resoning: that of nding maximal tractable subclasses of Allen's interval algebra, and that of reasoning with metric temporal information. Eight new maximal tractable subclasses of Allen's interval algebra are presented, some of them subsuming previously reported tractable algebras. The algebras allow for metric temporal constr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009